package com.yitiao.data_algorithms.leetcode.editor.cn;

class Qiu12nLcof {
    // 2023-04-27 10:46:58
    public static void main(String[] args) {
        Solution solution = new Qiu12nLcof().new Solution();
    }

    //leetcode submit region begin(Prohibit modification and deletion)
    class Solution {
        int res = 0;

        public int sumNums(int n) {
            boolean x = n > 1 && sumNums(n - 1) > 0;
            res += n;
            return res;
        }
    }
//leetcode submit region end(Prohibit modification and deletion)

}